Conformal Wasserstein distance: II. computational aspects and extensions

نویسندگان

  • Yaron Lipman
  • J. Puente
  • Ingrid Daubechies
چکیده

This paper is a companion paper to [19]. We provide numerical procedures and algorithms for computing the alignment of and distance between two disk type surfaces. We provide a convergence analysis of the discrete approximation to the arising mass-transportation problems. We furthermore generalize the framework to support sphere-type surfaces, and prove a result connecting this distance to local geodesic distortion. Lastly, we provide numerical experiments on several surfaces’ datasets and compare to state of the art method.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Conformal Wasserstein Distance: an Overview and Analysis Adrian Hagerty

Three-dimensional shape analysis has been developing extremely rapidly over the course of the past decade, and much of the research in this field has been catalyzed by the many advances in 3D scanning and printing. Two of the central problems in shape analysis are the development of meaningful characterizations of shape similarities and efficient computational methods to compute point correspon...

متن کامل

The Gromov-Wasserstein Distance: A Brief Overview

We recall the construction of the Gromov–Wasserstein distance and concentrate on quantitative aspects of the definition.

متن کامل

Conformal Wasserstein Distances: Comparing Surfaces in Polynomial Time

We present a constructive approach to surface comparison realizable by a polynomial-time algorithm. We determine the “similarity” of two given surfaces by solving a mass-transportation problem between their conformal densities. This mass transportation problem differs from the standard case in that we require the solution to be invariant under global Möbius transformations. We present in detail...

متن کامل

A Fast Proximal Point Method for Wasserstein Distance

Wasserstein distance plays increasingly important roles in machine learning, stochastic programming and image processing. Major efforts have been under way to address its high computational complexity, some leading to approximate or regularized variations such as Sinkhorn distance. However, as we will demonstrate, several important machine learning applications call for the computation of exact...

متن کامل

Multi-scale Non-Rigid Point Cloud Registration Using Robust Sliced-Wasserstein Distance via Laplace-Beltrami Eigenmap

In this work, we propose computational models and algorithms for point cloud registration with non-rigid transformation. First, point clouds sampled from manifolds originally embedded in some Euclidean space RD are transformed to new point clouds embedded in Rn by Laplace-Beltrami(LB) eigenmap using the n leading eigenvalues and corresponding eigenfunctions of LB operator defined intrinsically ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Math. Comput.

دوره 82  شماره 

صفحات  -

تاریخ انتشار 2013